Greedy Decentralized Auction-based Task Allocation for Multi-Agent Systems

نویسندگان

چکیده

We propose a decentralized auction-based algorithm for the solution of dynamic task allocation problems spatially distributed multi-agent systems. In our approach, each member team is assigned to at most one from set tasks, while several agents can be allocated same task. The assignment since it updated discrete time stages (iterations) account current states as latter move towards tasks them previous stage. Our proposed methods find applications in resource by intelligent machines such delivery packages fleet unmanned or semi-autonomous aerial vehicles. accounts both cost incurred completion their (e.g., energy fuel consumption) and rewards earned (which may reflect, instance, agents’ satisfaction). Greedy Coalition Auction Algorithm (GCAA) which possess bid vectors representing best evaluations utilities. bids, deduce an based on update after iteration. estimate converges finite number iterations cannot exceed agents. Finally, we use numerical simulations illustrate effectiveness (in terms performance computation time) scenarios involving multiple over spatial 2D domain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized cooperative auction for multiple agent task allocation using synchronized random number generators

− A collection of agents, faced with multiple tasks to perform, must effectively map agents to tasks in order to perform the tasks quickly with limited wasted resources. We propose a decentralized control algorithm based on synchronized random number generators to enact a cooperative task auction among the agents. The algorithm finds probabilistically reasonable solutions in a few rounds of bid...

متن کامل

Multi Agent Based Dynamic Task Allocation

Multi-Agent system, which is relatively a recent term, can be viewed as a sub-field of Distributed AI. In order to construct and solve complex real world problems like task allocation in an organization, a number of agents can perform work cooperatively and collaboratively. To achieve the maximum system utility through the proper task allocation among agents, there is a notion of dynamic team f...

متن کامل

Task allocation for multi-agent systems in dynamic environments

Multi-agent systems are frequently used in real world applications, with an increasing amount of agents and complexity. In order to accomplish the goals of the system, agents must cooperate using limited communication and knowledge of the environment. Task allocation for multi-agent systems in itself is a difficult problem and when both the tasks and the environment are dynamic, a robust yet ef...

متن کامل

Multi-Agent Task Allocation for Robot Soccer

This paper models and analyzes task allocation methodologies for multiagent systems. The evaluation process was implemented as a collection of simulated soccer matches. A soccer-simulation software package was used as the test-bed as it provided the necessary features for implementing and testing the methodologies. The methodologies were tested through competitions with a number of available so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2021

ISSN: ['2405-8963', '2405-8971']

DOI: https://doi.org/10.1016/j.ifacol.2021.11.249